Hardness of Online Sleeping Combinatorial Optimization Problems
نویسندگان
چکیده
We show that several online combinatorial optimization problems that admit efficient no-regret algorithms become computationally hard in the sleeping setting where a subset of actions becomes unavailable in each round. Specifically, we show that the sleeping versions of these problems are at least as hard as PAC learning DNF expressions, a long standing open problem. We show hardness for the sleeping versions of ONLINE SHORTEST PATHS, ONLINE MINIMUM SPANNING TREE, ONLINE k-SUBSETS, ONLINE k-TRUNCATED PERMUTATIONS, ONLINE MINIMUM CUT, and ONLINE BIPARTITE MATCHING. The hardness result for the sleeping version of the Online Shortest Paths problem resolves an open problem presented at COLT 2015 [Koolen et al., 2015].
منابع مشابه
Inapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization problems.
متن کاملLearning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
We propose a new approach to understanding the algorithm-specific empirical hardness of NP-Hard optimization problems. In this work we focus on the empirical hardness of the winner determination problem—an optimization problem arising in combinatorial auctions—when solved by ILOG’s CPLEX software. We consider nine widely-used problem distributions and sample randomly from a continuum of paramet...
متن کاملOn the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, MAXIMUM ACYCLIC SUBGRAPH and MAXIMUM BETWEENNESS, we prove NP-hard approximation factors of 14 15 + ε and 1 2 + ε . When it is hard to approximate an OCSP by a constant better than taking a uniformly-at-random ordering, then the OCSP is said to be approximation r...
متن کاملTitle of dissertation : PRIMAL - DUAL ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS Julián
Title of dissertation: PRIMAL-DUAL ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS Julián Mestre Doctor of Philosophy, 2007 Dissertation directed by: Professor Samir Khuller Department of Computer Science Combinatorial optimization problems such as routing, scheduling, covering and packing problems abound in everyday life. At a very high level, a combinatorial optimization problem amounts to...
متن کاملPrimal - Dual Algorithms for Combinatorial Optimization Problems
Title of dissertation: PRIMAL-DUAL ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS Julián Mestre Doctor of Philosophy, 2007 Dissertation directed by: Professor Samir Khuller Department of Computer Science Combinatorial optimization problems such as routing, scheduling, covering and packing problems abound in everyday life. At a very high level, a combinatorial optimization problem amounts to...
متن کامل